Adaptive Evolutionary Multitasking to Solve Inter-Domain Path Computation Under Node-Defined Domain Uniqueness Constraint: New Solution Encoding Scheme

In multi-domain networks, the efficiency of path computation becomes more and important. The Inter-Domain Path Computation under Node-defined Domain Uniqueness Constraint (IDPC-NDU) is a recently investigated problem where its objective to determine effective routing between two nodes that traverses every domain at most once. IDPC-NDU NP-Hard, so approximation approaches are suitable deal with this for large instances. Multifactorial Evolutionary Algorithm (MFEA) an emerging research topic in field evolutionary can efficiently tackle multiple optimization problems same time. This study proposed approach based on combination Adaptive (dMFEA-II) Dijkstra algorithm solving IDPC-NDU. encoding evaluating methods permutation representation also introduced, new individual always produce valid solutions. evaluated types Simulation results demonstrate superior performance comparison existing algorithms terms quality solution.